On the role of commutator arguments in the development of parameter-robust preconditioners for Stokes control problems

The development of preconditioners for PDE-constrained optimization problems is a field of numerical analysis which has recently generated much interest. One class of problems which has been investigated in particular is that of Stokes control problems, that is the problem of minimizing a functional with the Stokes (or Navier-Stokes) equations as constraints. In this manuscript, we present an approach for preconditioning Stokes control problems using preconditioners for the Poisson control problem and, crucially, the application of a commutator argument. This methodology leads to two block diagonal preconditioners for the problem, one of which was previously derived by W. Zulehner in 2011 (SIAM. J. Matrix Anal. & Appl., v.32) using a nonstandard norm argument for this saddle point problem, and the other of which we believe to be new. We also derive two related block triangular preconditioners using the same methodology, and present numerical results to demonstrate the performance of the four preconditioners in practice

A Radial Basis Function Method for Solving PDE Constrained Optimization Problems

In this article, we apply the theory of meshfree methods to the problem of PDE constrained optimization. We derive new collocation-type methods to solve the distributed control problem with Dirichlet boundary conditions and the Neumann boundary control problem, both involving Poisson's equation. We prove results concerning invertibility of the matrix systems we generate, and discuss a modication to guarantee invertibility. We implement these methods using MATLAB, and produce numerical results to demonstrate the methods' capability. We also comment on the methods' effectiveness in comparison to the widely-used finite element formulation of the problem, and make some recommendations as to how this work may be extended

Preconditioned iterative methods for Navier-Stokes control problems

PDE-constrained optimization problems are a class of problems which have attracted much recent attention in scientific computing and applied science. In this paper, we discuss preconditioned iterative methods for a class of Navier-Stokes control problems, one of the main problems of this type in the field of fluid dynamics. Having detailed the Oseen-type iteration we use to solve the problems and derived the structure of the matrix system to be solved at each step, we utilize the theory of saddle point systems to develop efficient preconditioned iterative solution techniques for these problems. We also require theory of solving convection-diffusion control problems, as well as a commutator argument to justify one of the components of the preconditioner

A rational deferred correction approach to parabolic optimal control problems

The accurate and efficient solution of time-dependent PDE-constrained optimization problems is a challenging task, in large part due to the very high dimension of the matrix systems that need to be solved. We devise a new deferred correction method for coupled systems of time-dependent PDEs, allowing one to iteratively improve the accuracy of low-order time stepping schemes. We consider two variants of our method, a splitting and a coupling version, and analyze their convergence properties. We then test our approach on a number of PDE-constrained optimization problems. We obtain solution accuracies far superior to that achieved when solving a single discretized problem, in particular in cases where the accuracy is limited by the time discretization. Our approach allows for the direct reuse of existing solvers for the resulting matrix systems, as well as state-of-the-art preconditioning strategies

A New Approximation of the Schur Complement in Preconditioners for PDE Constrained Optimization

Saddle point systems arise widely in optimization problems with constraints. The utility of Schur complement approximation is now broadly appreciated in the context of solving such saddle point systems by iteration. In this short manuscript, we present a new Schur complement approximation for PDE constrained optimization, an important class of these problems. Block diagonal and block triangular preconditioners have previously been designed to be used to solve such problems along with MINRES and non-standard Conjugate Gradients respectively; with appropriate approximation blocks these can be optimal in the sense that the time required for solution scales linearly with the problem size, however small the mesh size we use. In this paper, we extend this work to designing such preconditioners for which this optimality property holds independently of both the mesh size and of the Tikhonov regularization parameter \beta that is used. This also leads to an effective symmetric indefinite preconditioner that exhibits mesh and \beta-independence. We motivate the choice of these preconditioners based on observations about approximating the Schur complement obtained from the matrix system, derive eigenvalue bounds which verify the effectiveness of the approximation, and present numerical results which show that these new preconditioners work well in practice

Fast iterative solvers for convection-diffusion control problems

In this manuscript, we describe effective solvers for the optimal control of stabilized convection-diffusion problems. We employ the local projection stabilization, which we show to give the same matrix system whether the discretize-then-optimize or optimize-then-discretize approach for this problem is used. We then derive two effective preconditioners for this problem, the �first to be used with MINRES and the second to be used with the Bramble-Pasciak Conjugate Gradient method. The key components of both preconditioners are an accurate mass matrix approximation, a good approximation of the Schur complement, and an appropriate multigrid process to enact this latter approximation. We present numerical results to demonstrate that these preconditioners result in convergence in a small number of iterations, which is robust with respect to the mesh size h, and the regularization parameter β, for a range of problems

Robust Iterative Solution of a Class of Time-Dependent Optimal Control Problems

The fast iterative solution of optimal control problems, and in particular PDE-constrained optimization problems, has become an active area of research in applied mathematics and numerical analysis. In this paper, we consider the solution of a class of time-dependent PDE-constrained optimization problems, specifically the distributed control of the heat equation. We develop a strategy to approximate the (1,1)-block and Schur complement of the saddle point system that results from solving this problem, and therefore derive a block diagonal preconditioner to be used within the MINRES algorithm. We present numerical results to demonstrate that this approach yields a robust solver with respect to step-size and regularization parameter

Fast iterative solvers for PDE-constrained optimization problems

In this thesis, we develop preconditioned iterative methods for the solution of matrix systems arising from PDE-constrained optimization problems. In order to do this, we exploit saddle point theory, as this is the form of the matrix systems we wish to solve. We utilize well-known results on saddle point systems to motivate preconditioners based on effective approximations of the (1,1)-block and Schur complement of the matrices involved. These preconditioners are used in conjunction with suitable iterative solvers, which include MINRES, non-standard Conjugate Gradients, GMRES and BiCG. The solvers we use are selected based on the particular problem and preconditioning strategy employed. We consider the numerical solution of a range of PDE-constrained optimization problems, namely the distributed control, Neumann boundary control and subdomain control of Poisson's equation, convection-diffusion control, Stokes and Navier-Stokes control, the optimal control of the heat equation, and the optimal control of reaction-diffusion problems arising in chemical processes. Each of these problems has a special structure which we make use of when developing our preconditioners, and specific techniques and approximations are required for each problem. In each case, we motivate and derive our preconditioners, obtain eigenvalue bounds for the preconditioners where relevant, and demonstrate the effectiveness of our strategies through numerical experiments. The goal throughout this work is for our iterative solvers to be feasible and reliable, but also robust with respect to the parameters involved in the problems we consider